Capacity theory - PDFSEARCH.IO - Document Search Engine

Capacity theory
Results: 580

#	Item
41	2748 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 5, MAY 2012 Three-Receiver Broadcast Channels With Common and Confidential Messages Add to Reading List Source URL: isl.stanford.edu Language: English - Date: 2014-08-08 14:33:18 Information theory Information Theoretical computer science Telecommunications engineering Information-theoretic security Channel capacity Channel Code Noisy-channel coding theorem Binary symmetric channel
42	5218 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 12, DECEMBER 2006 Source Coding With Limited-Look-Ahead Side Information at the Decoder Add to Reading List Source URL: www-isl.stanford.edu Language: English - Date: 2010-03-02 17:20:32 Information theory Ratedistortion theory Distortion Lossless compression Entropy Channel capacity Distributed source coding SlepianWolf coding
43	Capacity Theorems for Relay Channels Abbas El Gamal Department of Electrical Engineering Stanford University April, 2006 Add to Reading List Source URL: isl.stanford.edu Language: English - Date: 2011-08-08 17:10:16 Information theory Relay channel Additive white Gaussian noise Channel capacity Information Technology Electronics
44	572 IEEE TRANSACTIONS ACKNOWLEDGMENT Add to Reading List Source URL: isl.stanford.edu Language: English - Date: 2011-04-21 12:46:30 Information theory Probability theory Additive white Gaussian noise Noise Conditioning Channel capacity Conditional independence Covariance Relay channel Noisy-channel coding theorem Mutual information
45	Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:23 Computational complexity theory Theory of computation Complexity classes Packing problems NP-complete problems Bin packing problem Approximation algorithms Polynomial-time approximation scheme Partition problem NP NC Time complexity
46	Jamming Mitigation by Randomized Bandwidth Hopping Marc Liechti Vincent Lenders Add to Reading List Source URL: www.lenders.ch Language: English - Date: 2015-12-04 14:03:52 Signal processing Radio resource management Multiplexing Information theory Wireless networking Direct-sequence spread spectrum Spread spectrum Process gain Bandwidth Frequency-hopping spread spectrum Eb/N0 Channel capacity
47	The Capacity of String-Replication Systems Farzad Farnoud (Hassanzadeh) Moshe Schwartz Jehoshua Bruck Add to Reading List Source URL: paradise.caltech.edu Language: English - Date: 2014-01-25 06:33:11 Mathematics Mathematical analysis Integer sequences Probability theory Automated theorem proving Logic programming Logical truth Substitution Automatic sequence
48	The Elusive 20% Time This is the original text of Alexei Zheglov’s sidebar on capacity utilization in Chapter 2. We had to edit Add to Reading List Source URL: agiletester.rumspeed.net Language: English - Date: 2014-09-16 09:12:51 Stochastic processes Operations research Network performance Queueing theory Queue management system Scheduling
49	USING INFORMATION THEORY TO STUDY THE EFFICIENCY AND CAPACITY OF COMPUTERS AND SIMILAR DEVICES Boris Ryabko Institute of Computational Technology of Siberian Branch of Russian Academy of Science Siberian State University Add to Reading List Source URL: sp.cs.tut.fi Language: English - Date: 2010-08-12 11:09:05 MMIX Computer MIX Reduced instruction set computing Assembly language Sequence Instruction set Computer architecture Donald Knuth Computing
50	Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma∗ , Jiang Chen∗ , Yang Richard Yang∗ and Arvind Krishnamurthy† ∗ Department of Computer Science Add to Reading List Source URL: www-net.cs.yale.edu Language: English - Date: 2006-06-12 11:14:33 Graph theory Network flow Distributed computing architecture Network architecture Overlay network Peer-to-peer Maximum flow problem Network congestion Shortest path problem Mathematics Operations research Applied mathematics

UPDATE